Metaheuristic Algorithms for Container Loading Problem by Grouping Objects
نویسندگان
چکیده
منابع مشابه
An optimization system for container loading based on metaheuristic algorithms
Abstract. A family octs, and computational requirement. Commonsense and expert knowledge incorporation is considered to combine with metaheuristics. Handling groups of objects in a metaheuristic scheme is moreover considered. Numerical examples are given.
متن کاملAlgorithms for the Container Loading Problem
In this paper we consider the three-dimensional problem of optimal packing of a container with rectangular pieces. We propose an approximation algorithm based on the "forward state strategy" of dynamic programming. A suitable description of packings is developed for the implementation of the approximation algorithm, and some computational experience is reported. Zusammenfassung: Zur nn aherungs...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملAlgorithms for container loading
The container loading problem consists of packing boxes of various sizes into available containers in a way which optimizes some objective function. The container loading is the core of many problems which arise in distribution and logistics. As the amount of distributed goods grows and with it the need for automation of distribution processes, also the need for computational models and methods...
متن کاملHeuristics for the container loading problem
The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
سال: 2006
ISSN: 1881-7203,1347-7986
DOI: 10.3156/jsoft.18.859